GENERATION ALGORITHM OF DISCRETE LINE IN MULTI-DIMENSIONAL GRIDS
نویسندگان
چکیده
منابع مشابه
Discrete Multi-Dimensional Scaling
In recent years, a number of models of lexical access based on attractor networks have appeared. These models reproduce a number of effects seen in psycholinguistic experiments, but all suffer from unrealistic representations of lexical semantics. In an effort to improve this situation we are looking at techniques developed in the information retrieval literature that use the statistics found i...
متن کاملMulti-objective and Scalable Heuristic Algorithm for Workflow Task Scheduling in Utility Grids
To use services transparently in a distributed environment, the Utility Grids develop a cyber-infrastructure. The parameters of the Quality of Service such as the allocation-cost and makespan have to be dealt with in order to schedule workflow application tasks in the Utility Grids. Optimization of both target parameters above is a challenge in a distributed environment and may conflict one an...
متن کاملFast Discrete Multi-Dimensional Scaling
Multi-dimensional scaling (MDS) is the process of transforming a set of vectors in a high dimensional space to a lower dimensional one while preserving the similarity structure of the vectors. While effective methods have been found for solving this problem in the general case, they depend on the vectors in the lower dimensional space having real-valued components. However, for some application...
متن کاملScheduling of scientific workflows using Discrete PSO Algorithm for Grids
Grid computing systems utilize distributive owned and geographically dispersed resources for providing a wide variety of services for various applications. It is possible that the job submission for the resource request by resource consumers can be large owing to wide area distribution of grid. Key services such as resource discovery, monitoring and scheduling are inherently more complicated in...
متن کاملDiscrete topology on N-dimensional square tessellated grids
Topology preservation and detection is a well known concept in the processing of 2and 3-dimensional binary images. These images can be considered as sets that are mapped on square tessellated (hyper cubic) grids. This paper describes how the formalisms derived for 2D and 3D images can be expanded to N-dimensional images, i.e. binary point sets that are aligned on an N-dimensional square tessell...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences
سال: 2017
ISSN: 2194-9034
DOI: 10.5194/isprs-archives-xlii-2-w7-11-2017